Path graph

Results: 1083



#Item
611This PDF is a selection from an out-of-print volume from the National Bureau of Economic Research Volume Title: International and Interarea Comparisons of Income, Output, and Prices Volume Author/Editor: Alan Heston and

This PDF is a selection from an out-of-print volume from the National Bureau of Economic Research Volume Title: International and Interarea Comparisons of Income, Output, and Prices Volume Author/Editor: Alan Heston and

Add to Reading List

Source URL: www.nber.org

Language: English - Date: 2008-09-22 16:00:29
612On the Difficulty of Learning Power Law Graphical Models Rashish Tandon Pradeep Ravikumar

On the Difficulty of Learning Power Law Graphical Models Rashish Tandon Pradeep Ravikumar

Add to Reading List

Source URL: www.cs.utexas.edu

Language: English - Date: 2013-11-23 00:08:40
613Simultaneous Source Location Konstantin Andreev1? , Charles Garrod1? , Bruce Maggs1 , and Adam Meyerson2? 1  2

Simultaneous Source Location Konstantin Andreev1? , Charles Garrod1? , Bruce Maggs1 , and Adam Meyerson2? 1 2

Add to Reading List

Source URL: www.akamai.com

Language: English - Date: 2006-09-21 21:38:54
614GraphChi: Large-Scale Graph Computation on Just a PC Aapo Kyrola Carnegie Mellon University [removed]  Guy Blelloch

GraphChi: Large-Scale Graph Computation on Just a PC Aapo Kyrola Carnegie Mellon University [removed] Guy Blelloch

Add to Reading List

Source URL: select.cs.cmu.edu

Language: English - Date: 2012-10-15 23:55:44
615A Graphical Model for Simultaneous Partitioning and Labeling  Philip J. Cowans Cavendish Laboratory, University of Cambridge, Cambridge, CB3 0HE, United Kingdom [removed]

A Graphical Model for Simultaneous Partitioning and Labeling Philip J. Cowans Cavendish Laboratory, University of Cambridge, Cambridge, CB3 0HE, United Kingdom [removed]

Add to Reading List

Source URL: www.inference.phy.cam.ac.uk

Language: English - Date: 2004-11-25 09:53:24
616Improved Quantum Query Complexity Bounds for Some Graph Problems Prafulla Dhariwal, Vinay Mayar Abstract We prove improved quantum query complexity bounds for some graph problem. Our results are based on a new quantum al

Improved Quantum Query Complexity Bounds for Some Graph Problems Prafulla Dhariwal, Vinay Mayar Abstract We prove improved quantum query complexity bounds for some graph problem. Our results are based on a new quantum al

Add to Reading List

Source URL: www.scottaaronson.com

Language: English - Date: 2014-12-25 20:29:06
617Exploration of Monte-Carlo based Probabilistic Query Processing in Uncertain Graphs Tobias Emrich, Hans-Peter Kriegel, Johannes Niedermayer, Matthias Renz, André Suhartha, Andreas Züfle Institute for Informatics, Ludwi

Exploration of Monte-Carlo based Probabilistic Query Processing in Uncertain Graphs Tobias Emrich, Hans-Peter Kriegel, Johannes Niedermayer, Matthias Renz, André Suhartha, Andreas Züfle Institute for Informatics, Ludwi

Add to Reading List

Source URL: www.dbs.ifi.lmu.de

Language: English - Date: 2012-08-20 11:11:00
618Microsoft PowerPoint - AM I Networks.ppt [Compatibility Mode]

Microsoft PowerPoint - AM I Networks.ppt [Compatibility Mode]

Add to Reading List

Source URL: www.lsa.ethz.ch

Language: English - Date: 2011-04-11 09:43:08
619[removed]User evaluation: how? “To investigate the use of a visual mouse in a text reading task”

[removed]User evaluation: how? “To investigate the use of a visual mouse in a text reading task”

Add to Reading List

Source URL: www.egc.asso.fr

Language: English
620Exemplar Queries: Give me an Example of What You Need Davide Mottin Matteo Lissandrini  Yannis Velegrakis

Exemplar Queries: Give me an Example of What You Need Davide Mottin Matteo Lissandrini Yannis Velegrakis

Add to Reading List

Source URL: www.vldb.org

Language: English - Date: 2013-12-06 16:23:06